The Algorithmic Aspects of Network Slicing
نویسندگان
چکیده
منابع مشابه
analysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولassessment of the efficiency of s.p.g.c refineries using network dea
data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...
Algorithmic Aspects of the Internet
ACKNOWLEDGEMENTS First, I would like to thank my advisors, Milena Mihail and Vijay Vazirani, for all I have learned from them and for sharing their insights with me which was invaluable during these four years. I also thank Dana Randall, Dick Lipton and other faculty of the ACO and College of Computing. I have also been very lucky to have wonderful colleagues and As a final note, I would like t...
متن کاملAlgorithmic Combinatorics Based on Slicing Posets
Authors retain or are hereby granted (without the need to obtain further permission) rights to use the article for traditional scholarship communications, for teaching, and for distribution within their institution, as set out in the General Terms of Publication (see note 1), and also agree to the other terms.
متن کاملAlgorithmic Aspects of Regularity
Szemer edi's celebrated regularity lemma proved to be a fundamental result in graph theory. Roughly speaking, his lemma states that any graph may be approximated by a union of a bounded number of bipartite graphs, each of which is`pseudorandom'. As later proved by Alon, Duke, Lefmann, RR odl, and Yuster, there is a fast deterministic algorithm for nding such an approximation, and therefore many...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Magazine
سال: 2017
ISSN: 0163-6804,1558-1896
DOI: 10.1109/mcom.2017.1600939